Trucks Scheduling to Reduce Delays in Multiple Cross-Docks Using Imperialist Competitive Algorithm

Cross docking is a logistics strategy that is now used by a large number of firms in the various industries. Cross docking effectively a significant reduction in transport costs, without increasing inventory and at the same time maintain the level of service to customers. It also can cross dock order to reduce cycle time, improve flexibility and responsiveness lead distribution network. In this study, there are considers a truck scheduling problem in a multiple cross docks while there is temporary storage in front of the shipping docks with a limited capacity and delay times. Receiving trucks can intermittently move in and out of the docks during the time intervals between their task execution, in which trucks can enter to any of the cross docks. Thus, a mixed-integer programming (MIP) model for multiple cross docks scheduling is developed inspired by models in the body of the respective literature. Its objective is to minimize the sum of tardiness or maximize the throughput of the cross-docking system. Moreover, additional concepts considered in the new method is multiple cross docks with a limited capacity and two types of delay times. In this study, first the software GAMS is used to achieve the optimal solution, then according to the complexity of the model and increase the search space to achieve precise answer on the big issues, meta heuristic algorithm for as Imperialist Competitive Algorithm (ICA) is used to solve model and Numerical results are analyzed.